Automata-Theoretic Approach to Planning for Temporally Extended Goals
نویسندگان
چکیده
We study an automata-theoretic approach to planning for temporally extended goals. Specifically, we devise techniques based on nonemptiness of Büchi automata on infinite words, to synthesize sequential and conditional plans in a generalized setting in which we have that: goals are general temporal properties of desired execution; dynamic systems are represented by finite transition systems; incomplete information on the initial situation is allowed; and states are only partially observable. We prove that the techniques proposed are optimal wrt the worst case complexity of the problem. Thanks to the scalability of the nonemptiness algorithms, the techniques presented here promise to be applicable to fairly large systems, notwithstanding the intrinsic complexity of the problem.
منابع مشابه
Automata - Theoretic Approach to Planning forTemporally Extended
We study an automata-theoretic approach to planning for temporally extended goals. Speciically, we devise techniques based on nonemptiness of B uchi automata on innnite words, to synthesize sequential and conditional plans in a generalized setting in which we have that: goals are general temporal properties of desired execution; dynamic systems are represented by nite transition systems; incomp...
متن کاملNon-Deterministic Planning with Temporally Extended Goals: Completing the Story for Finite and Infinite LTL (Amended Version)
Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of planning with temporally extended goals over both finite and infinite traces where actions can be nondeterministic, and where temporally extended goals are specified in linear temporal logic (LTL). Unlike existing LTL planners, we place no restrictions on ou...
متن کاملPolynomial-Time Reformulations of LTL Temporally Extended Goals into Final-State Goals
Linear temporal logic (LTL) is an expressive language that allows specifying temporally extended goals and preferences. A general approach to dealing with general LTL properties in planning is by “compiling them away”; i.e., in a pre-processing phase, all LTL formulas are converted into simple, non-temporal formulas that can be evaluated in a planning state. This is accomplished by first genera...
متن کاملA Planning Model for Concurrent Asynchronous Automata
In this work a new approach based on planning paradigm is proposed in order to describe the interactions of concurrent asynchronous automata. The behaviour of a set of nondeterministic asynchronous automata which interact via common variables in a conflictfree environment is modelled through an appropriate planning domain such that the set of valid plans in the domain represents the set of poss...
متن کاملAgent programming with temporally extended goals
In planning as well as in other areas, temporal logic has been used to specify so-called temporally extended goals. Temporally extended goals refer to desirable sequences of states instead of a set of desirable final states as the traditional notion of achievement goal does, and provide for more variety in the types of goals allowed. In this paper, we show how temporally extended goals can be i...
متن کامل